Modular Construction of Shape-Numeric Analyzers
نویسندگان
چکیده
منابع مشابه
Modular Construction of Shape-Numeric Analyzers
environments: Since the abstract counterpart for addresses are symbolic variables (or nodes) in shape graphs, an abstract environment E can simply be a function mapping program variables to nodes, that is, E ∈ E =X→V. Now, the memory abstract domainM is defined byM = E× (H ⇒ N ), and its concretization γM :M ♯ → P(E×H) can be defined as follows: γM(E ,(σ ,ν)) def = {(ν ◦E,σ) | (σ ,ν) ∈ γH(σ ) a...
متن کاملToolkits for the Automatic Construction of Data Flow Analyzers
interpretation approach fail to account for the fact that a recursive call creates new copies of all local variables (and hence a new abstract state), and upon return the old abstract state must be restored: the functional approach does not keep the call stack, and the call string approach does not correctly restore context local to the caller. Their solution [KRS92, Kno98] is essentially a fun...
متن کاملEFFICIENT SIMULATION FOR OPTIMIZATION OF TOPOLOGY, SHAPE AND SIZE OF MODULAR TRUSS STRUCTURES
The prevalent strategy in the topology optimization phase is to select a subset of members existing in an excessively connected truss, called Ground Structure, such that the overall weight or cost is minimized. Although finding a good topology significantly reduces the overall cost, excessive growth of the size of topology space combined with existence of varied types of design variables challe...
متن کاملModular Construction of DTE Policies
This paper describes a tool which composes a policy for a fine-grained mandatory access control system (DTE) from a set of mostly independent policy modules. For a large system with many services, a DTE policy becomes unwieldy. However, many system services and security extensions can be considered to be largely standalone. By providing for explicit grouping, namespaces, and globbing by namespa...
متن کاملModular Construction of Modal Logics
We present a modular approach to defining logics for a wide variety of state-based systems. We use coalgebras to model the behaviour of systems, and modal logics to specify behavioural properties of systems. We show that the syntax, semantics and proof systems associated to such logics can all be derived in a modular way. Moreover, we show that the logics thus obtained inherit soundness, comple...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Electronic Proceedings in Theoretical Computer Science
سال: 2013
ISSN: 2075-2180
DOI: 10.4204/eptcs.129.11